Congestion Domain Boundaries in Resilient Packet Rings
نویسندگان
چکیده
In June 2004, the IEEE approved a new standard for Resilient Packet Rings (RPR). The standard is maintained in the 802 LAN/MAN Standards Committee, and is designated the standard number 802.17. In this paper, we analyze and discuss performance aspects of the Resilient Packet Ring fairness mechanism. We explain that, if the ring is not configured correctly, the fairness mechanism fails to stabilize at a fair division of bandwidth between the active nodes. We present a novel addition to the fairness algorithm, and show that with this modification, RPR reaches a stable state with more optimal parameter settings. We also show that our proposed modification gives shorter convergence time for the Resilient Packet Ring fairness algorithm.
منابع مشابه
SSA: simple scheduling algorithm for resilient packet ring networks
The resilient packet ring (RPR), defined under IEEE 802.17, has been proposed as a high-speed backbone technology for metropolitan area networks. RPR is introduced to mitigate the underutilisation and unfairness problems associated with the current technologies SONET and Ethernet, respectively. The key performance objectives of RPR are to achieve high bandwidth utilisation, optimum spatial reus...
متن کاملPacket Transfer Delay Comparison of a Store-and-Forward and a Cut-Through Resilient Packet Ring
Based on queuing theory we develop analytical approximations for the average packet transfer time of a store-and-forward and a cutthrough buffer insertion ring with two client traffic priorities. These types of rings are architectural alternatives for resilient packet rings (RPR) which transport data (e.g., IP) packets over optical media. We use the approximations for a delay comparison of both...
متن کاملHigh Performance Fair Bandwidth Allocation for Resilient Packet Rings
The Resilient Packet Ring (RPR) IEEE 802.17 standard is under development as a new high-speed backbone technology for metropolitan area networks. A key performance objective of RPR is to simultaneously achieve high utilization, spatial reuse, and fairness, an objective not achieved by current technologies such as SONET and Gigabit Ethernet nor by legacy ring technologies such as FDDI. The core ...
متن کاملRouting Algorithms in Resilient Packet Rings
-The Resilient Packet Ring (RPR) is a data ring network, where one of the key issues is on a load balancing for competing streams of elastic traffic. This paper suggests efficient routing algorithms on the RPR. For the algorithms, we evaluate their efficiency via simulation. Key-Words: Resilient Packet Ring, Unsplit Loading, Heuristic Algorithm, Simulation
متن کاملVRED: An improvement over RED algorithm by using queue length growth velocity
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
متن کامل